Hadamard matrices of order 32
نویسندگان
چکیده
Two Hadamard matrices are considered equivalent if one is obtained from the other by a sequence of operations involving row or column permutations or negations. We complete the classification of Hadamard matrices of order 32. It turns out that there are exactly 13710027 such matrices up to equivalence. AMS Subject Classification: 05B20, 05B05, 05B30.
منابع مشابه
On the classification of Hadamard matrices of order 32
All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of inequivalent Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13,680,757 Hadamard matrices of one type and 26,369 such matrices of another t...
متن کاملThe cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is describe...
متن کاملHadamard matrices of order 36 and double-even self-dual [72,36,12] codes
A balanced incomplete block design (BIBD) [1] with parameters 2-(v, b, r, k, λ) (short 2-(v, k, λ)) is a pair (V,B) where V is a v-set (elements are called points) and B is a collection of b k-subsets (elements are called blocks) of V such that each point is contained in exactly r blocks and any pair of points is contained in exactly λ blocks. A Hadamard matrix of order n is an n × n (1,−1)-mat...
متن کاملModular Sequences and Modular Hadamard Matrices
For every n divisible by 4, we construct a square matrix H of size n, with coeecients 1, such that H H t nI mod 32. This solves the 32-modular version of the classical Hadamard conjecture. We also determine the set of lengths of 16-modular Golay sequences. 0. Introduction Hadamard matrices can be constructed from various binary sequences, either from Golay complementary sequences, or Williamson...
متن کاملSwitching Operations for Hadamard Matrices
We define several operations that switch substructures of Hadamard matrices thereby producing new, generally inequivalent, Hadamard matrices. These operations have application to the enumeration and classification of Hadamard matrices. To illustrate their power, we use them to greatly improve the lower bounds on the number of equivalence classes of Hadamard matrices in orders 32 and 36 to 3,578...
متن کامل